Goto

Collaborating Authors

 algorithm 2










Appendix 420 A Missing Proofs of Section 4 421

Neural Information Processing Systems

We start by proving statement (ii). We now prove statement (iii). The last constraint is trivially satisfied. This can be easily shown by induction. 's constraint remains equal when Let's pick such a branching Moreover, observe that every edge in B is tight.